A Hierarchical Block Matching Algorithm Using Selective Elimination of Candidate Motion Vectors
نویسندگان
چکیده
In this paper, a new hierarchical block matching algorithm using mean and difference pyramids is presented. The detection of motion vectors at each level of the pyramid is accomplished by selectively eliminating the candidate motion vectors that cannot provide the best match at the next lower level. The remaining motion vectors at each level are propagated and used as the initial motion vectors at the next lower level. Therefore, the possibility of falling into local minima can be significantly reduced. The simulation results show that the proposed method has excellent performance with reduced computational complexity. key words: motion estimation, motion vector, BMA, pyramid structure
منابع مشابه
Extended Successive Elimination Algorithm for Fast Optimal Block Matching Motion Estimation
In this paper, we propose an extended successive elimination algorithm (SEA) for fast optimal block matching motion estimation (ME). By reinterpreting the typical sum of absolute differences measure, we can obtain additional decision criteria whether to discard the impossible candidate motion vectors. Experimental results show that the proposed algorithm reduces the computational complexity up ...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملA hierarchical block matching algorithm using partial distortion criterion
A new block matching algorithm (BMA) especially appropriate for large search areas is proposed. Motion vectors of causally adjacent blocks can be credible motion vector candidates in continuous motion fields. However, they are not helpful for searching complex or random motions. In order to remedy this problem, we propose a new two-step hierarchical block matching algorithm using spatial correl...
متن کاملAn efficient true-motion estimator using candidate vectors from a parametric motion model
Some efficient motion estimation algorithms select their output motion vector from a limited number of likely correct candidate, or prediction, vectors. In this paper, next to the known spatial and temporal prediction vectors, an additional and independent prediction is proposed. This candidate is generated with a parametric model describing the global motion in a previously estimated motion ve...
متن کاملEFBLA: A Two-Phase Matching Algorithm for Fast Motion Estimation
Introduction: The most popular algorithm for the VLSI implementation of motion estimation is the block-based full-search algorithm [1–3]. However, the full-search algorithm notoriously needs high computation load and large memory size. The high computational cost has become a major problem in the implementation of motion estimation. Many papers have proposed different ways to reduce the computa...
متن کامل